Asymmetric cost aggregation network for efficient stereo matching
نویسندگان
چکیده
Cost aggregation is crucial to the accuracy of stereo matching. A reasonable cost algorithm should aggregate costs within homogeneous regions where pixels have same or similar disparities. Otherwise, estimated disparity map prone well-known edge-fattening issue and problem losing fine structures. However, current state-of-the-art convolutional neural networks (CNNs) mainly do with square-kernel layers that learn adjust their kernel elements make actual receptive fields aggregated adapt various shapes. This a mechanism easily leads above issues due translation equivalence content-insensitivity properties CNNs. To tackle these problems, novel densely connected asymmetric convolution block (Dense-ACB) based on convolutions proposed explicitly construct shapes, which effectively alleviates caused by mismatching shapes regions. The Dense-ACB brings new insight CNN-based matching networks. Based method, an efficient effective network built, not only achieves competitive overall compared models but also preserves
منابع مشابه
Deep Stereo Matching with Explicit Cost Aggregation Sub-Architecture
Deep neural networks have shown excellent performance for stereo matching. Many efforts focus on the feature extraction and similarity measurement of the matching cost computation step while less attention is paid on cost aggregation which is crucial for stereo matching. In this paper, we present a learning-based cost aggregation method for stereo matching by a novel sub-architecture in the end...
متن کاملEfficient Stereo Matching Using Histogram Aggregation with Multiple Slant Hypotheses
This paper presents an enhancement to the recent framework of histogram aggregation [1], that enables to improve the matching accuracy while preserving a low computational complexity. The original algorithm uses a fronto-parallel support window for cost aggregation, which leads to inaccurate results in the presence of significant surface slant. We address the problem by considering a pre-define...
متن کاملPyramid Stereo Matching Network
Recent work has shown that depth estimation from a stereo pair of images can be formulated as a supervised learning task to be resolved with convolutional neural networks (CNNs). However, current architectures rely on patch-based Siamese networks, lacking the means to exploit context information for finding correspondence in illposed regions. To tackle this problem, we propose PSMNet, a pyramid...
متن کاملEfficient Semi-global Matching for Trinocular Stereo
This paper describes an efficient method for dense matching of two or three images. After some investigations in different similarity measures we propose a modification of Semi-Global Matching, which uses a simple energy function that implies piecewise smoothness but no ordering and gives promising results in practice. Our improvements include a symmetric and hierarchical matching strategy and ...
متن کاملEfficient Large-Scale Stereo Matching
In this paper we propose a novel approach to binocular stereo for fast matching of high-resolution images. Our approach builds a prior on the disparities by forming a triangulation on a set of support points which can be robustly matched, reducing the matching ambiguities of the remaining points. This allows for efficient exploitation of the disparity search space, yielding accurate dense recon...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Iet Image Processing
سال: 2023
ISSN: ['1751-9659', '1751-9667']
DOI: https://doi.org/10.1049/ipr2.12807